A Multi-objective Evolutionary Hybrid Optimizer

نویسندگان

  • George S. Dulikravich
  • Ramon J. Moral
  • Debasis Sahoo
چکیده

A new hybrid multi-objective, multivariable optimizer utilizing Strength Pareto Evolutionary Algorithm (SPEA), Non-dominated Sorting Differential Evolution (NSDE), and Multi-Objective Particle Swarm (MOPSO) has been created and tested. The optimizer features automatic switching among these algorithms to expedite the convergence of the optimal Pareto front in the objective function(s) space. The ultimate goal of using such a hybrid optimizer is to lower the total number of objective function evaluations in multiobjective multi-extrema optimisation problems. The SPEA is an elitist evolutionary algorithm proposed by Zitzler and Thiele. The algorithm introduces elitism by maintaining an external population for the non-dominated set at each of the iterations. This algorithm uses the elite members in genetic operation to steer the population towards optimal region in multi-dimensional search space. It has the in-built clustering technique, which helps in creating a better spread of the non-dominated solutions. It also supports multi-variables and multi-objective functions. The algorithm has been tested for standard multi-objective test functions and given acceptable results. The MOPSO algorithm is a modified version on the algorithm proposed by Eberhart and Kennedy. Although this implementation of the original algorithm is primitive, MOPSO supports multi-variables and multi-objective functions. The algorithm has shown the ability to find acceptable optimal Pareto fronts for numerous standard multi-objective test functions. George S. Dulikravich, Ramon J. Moral and Debasis Sahoo.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Objective Hybrid Evolutionary Optimization with Automatic Switching Among Constituent Algorithms

In this work, a multi-objective hybrid optimizer is presented. The optimizer uses several multi-objective evolutionary optimization algorithms and orchestrates the application of these algorithms to multi-objective optimization problems, using an automatic internal switching algorithm. The switching algorithm is designed to favor those search algorithms that quickly improve the Pareto approxima...

متن کامل

A Hybrid Evolutionary Approach to Solve Multi-objective Optimization Problems based on Particle Swarm Optimizer and Genetic Algorithm

Handling multi-objective optimization problems using evolutionary computations represents a promising interest area of research, especially the hybrid evolutionary computations. In multi-objective optimization problems the decision maker is interested in determining the set of Pareto-optimal solutions instead of single solution. This paper presents a hybrid evolutionary approach to solve this c...

متن کامل

Solving ‎‎‎Multi-objective Optimal Control Problems of chemical ‎processes ‎using ‎Hybrid ‎Evolutionary ‎Algorithm

Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier‎. ‎This paper applies an evolutionary optimization scheme‎, ‎inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...

متن کامل

A Hybrid MOEA/D-TS for Solving Multi-Objective Problems

In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...

متن کامل

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005